Extra edge connectivity and isoperimetric edge connectivity
نویسندگان
چکیده
منابع مشابه
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
For a connected graphG= (V ,E), an edge set S ⊂ E is a k-restricted-edge-cut, ifG−S is disconnected and every component of G− S has at least k vertices. The k-restricted-edge-connectivity of G, denoted by k(G), is defined as the cardinality of a minimum k-restricted-edge-cut. The k-isoperimetric-edge-connectivity is defined as k(G)=min{|[U,U ]| : U ⊂ V, |U | k, |U | k}, where [U,U ] is the set ...
متن کاملExtra edge connectivity of hypercube-like networks
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملEdge-connectivity and edge-disjoint spanning trees
where the minimum is taken over all subsets X of E(G) such that ω(G − X) − c > 0. In this paper, we establish a relationship 7 between λc(G) and τc−1(G), which gives a characterization of the edge-connectivity of a graph G in terms of the spanning tree 8 packing number of subgraphs of G. The digraph analogue is also obtained. The main results are applied to show that if a graph G is 9 s-hamilto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.066